Fast Numerical Coarsening with Local Factorizations

نویسندگان

چکیده

Numerical coarsening methods offer an attractive methodology for fast simulation of objects with high-resolution heterogeneity. However, they rely heavily on preprocessing, and are not suitable when undergo dynamic material or topology updates. We present that largely accelerate the two main processes numerical coarsening, namely training data generation optimization shape functions, as a result we manage to leverage runtime under local To data, propose domain-decomposition solver based substructuring leverages factorizations. computation decoupled smoothness fitting. evaluate quantitatively accuracy performance our proposed methods, show achieve comparable baseline, albeit speed-ups orders magnitude. also demonstrate example simulations

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximally fast coarsening algorithms.

We present maximally fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time step Deltat=At2/3s. We compare the scaling structure obtained from our maximally fast conserved systems directly against the standard fixed time-step Euler algorithm, and find that the error scales as square root of A--so arbitrary accuracy can be achieved. Fo...

متن کامل

Fast numerical methods for non-local operators

H-Matrix LU-decomposition based preconditioners for BEM

متن کامل

Parallel Factorizations in Numerical Analysis

In this paper we review the parallel solution of sparse linear systems, usually deriving by the discretization of ODEIVPs or ODE-BVPs. The approach is based on the concept of parallel factorization of a (block) tridiagonal matrix. This allows to obtain efficient parallel extensions of many known matrix factorizations, and to derive, as a by-product, a unifying approach to the parallel solution ...

متن کامل

Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations

Nonnegative matrix factorization (NMF) and its extensions such as Nonnegative Tensor Factorization (NTF) have become prominent techniques for blind sources separation (BSS), analysis of image databases, data mining and other information retrieval and clustering applications. In this paper we propose a family of efficient algorithms for NMF/NTF, as well as sparse nonnegative coding and represent...

متن کامل

Numerical study of domain coarsening in anisotropic stripe patterns.

We study the coarsening of two-dimensional smectic polycrystals characterized by grains of oblique stripes with only two possible orientations. For this purpose, an anisotropic Swift-Hohenberg equation is solved. For quenches close enough to the onset of stripe formation, the average domain size increases with time as t(1/2). Further from onset, anisotropic pinning forces similar to Peierls str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Graphics Forum

سال: 2022

ISSN: ['1467-8659', '0167-7055']

DOI: https://doi.org/10.1111/cgf.14619